Shared-communications channel utilization for applications having different class of service requirements

ABSTRACT

A technique is disclosed that enables latency-tolerant and latency-intolerant applications to intelligently share a shared-communications channel in a manner that seeks to satisfy the needs of all of the applications. In particular, the illustrative embodiment enables each application to be associated with a different class of service, wherein each class of service is associated with one or more quality-of-service parameters (e.g., minimum throughput, maximum latency, etc.). The illustrative embodiment then effectively apportions access to the shared-communications channel by regulating different degrees of bursting (i.e., the transmission of multiple frames at a single transmission opportunity) based on the class of service associated with the application.

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] This application claims the benefit of United States provisional patent application serial No. 60/363,242, filed on Mar. 8, 2002, Attorney Docket 680-043us, and entitled “Method Of Differentiating And Preserving Network Transmissions,” which is also incorporated by reference.

FIELD OF THE INVENTION

[0002] The present invention relates to telecommunications in general, and, more particularly, to a technique for enabling the stations in a local area network to intelligently use their shared-communications channel.

BACKGROUND OF THE INVENTION

[0003]FIG. 1 depicts a schematic diagram of telecommunications system 100 in the prior art. Telecommunications system 100 transmits signals between communication stations 101-1 through 101-P, wherein P is a positive integer, over shared-communications channel 102. Because stations 101-1 through 101-P share shared-communications channel 102, they have to follow rules (or “protocols”) that govern, among other things, when and for how long they can each use the channel.

[0004] Many types of applications (e.g., e-mail, ftp, http, voice, video, etc.) send data across a local area network. The data for some of these applications—e-mail and web browsing for example—can be send with a lesser degree of urgency and, therefore, are called “latency-tolerant.” In contrast, the data for some other applications—particularly those that comprise a real-time component like video and audio—must traverse the network with a greater degree of urgency. These applications are called “latency-intolerant.”

[0005] IEEE 802.11 local area networks were initially designed for latency-tolerant applications and typically each of those applications share access to the shared-communications channel on an equal basis. This is usually acceptable for latency-tolerant applications. In contrast, this is often unacceptable for latency-intolerant applications because giving equal access to latency-tolerant and latency-intolerant applications might prevent the latency-intolerant application from getting its data in a timely manner.

[0006] If the latency-intolerant applications is deemed to be important, then a mechanism must be introduced into the network so that the latency-intolerant applications are given the amount of resources they need in a timely manner. Therefore, the need exists for a technique for enabling latency-tolerant and latency-intolerant applications to intelligently share access to the shared-communication channel.

SUMMARY OF THE INVENTION

[0007] The present invention enables latency-tolerant and latency-intolerant applications to intelligently share a shared-communications channel in a manner that seeks to satisfy the needs of all of the applications. In particular, the illustrative embodiment enables each application to be associated with a different class of service, wherein each class of service is associated with one or more quality-of-service parameters (e.g., minimum throughput, maximum latency, etc.).

[0008] The illustrative embodiment then effectively apportions access to the shared-communications channel by having the station transmit multiple frames at a single transmission opportunity (i.e., bursting) and by regulating the number of frames in each burst based on the class of service associated with the application.

[0009] Bursting is known in the prior art as a technique for increasing the bandwidth utilization of a shared-communications channel. In contrast, the illustrative embodiment utilizes bursting, and regulates the number of frames in each burst, to balance the needs of applications having different class of service parameters.

[0010] In the context of IEEE 802.11 local area networks, the illustrative embodiment is advantageous because it does not require a change to 802.11's coordination function (e.g., distributed coordination function, enhanced distributed coordination function, point coordination function, etc.). Furthermore, stations in accordance with the illustrative embodiment continue to gain access to the shared-communications channel on a statistically-equal basis, although higher-class-of-service applications are able to transmit more frames at each transmission opportunity than are lower-class-of service applications. The result is that applications having different class of service parameters are treated differently, yet while the statistical properties of the access coordination function remain unchanged.

[0011] An illustrative embodiment of the present invention comprises: queuing m frames in a queue; and transmitting a maximum of n frames of the m frames into a shared-communications channel when presented with an opportunity to transmit all m frames into the shared-communications channel; wherein m and n are positive integers and m>n.

BRIEF DESCRIPTION OF THE DRAWINGS

[0012]FIG. 1 depicts a schematic diagram of telecommunications system 100 in the prior art.

[0013]FIG. 2 depicts a block diagram of the salient components of a station in accordance with the illustrative embodiment of the present invention.

[0014]FIG. 3 depicts a flowchart of the illustrative embodiment of the present invention.

[0015]FIG. 4 depicts a timeline of the frames transmitted in accordance with the illustrative embodiment of the present invention.

DETAILED DESCRIPTION

[0016]FIG. 2 depicts a block diagram of the salient components of an IEEE 802.11 station in accordance with the illustrative embodiment of the present invention. Station 200 is capable of receiving a succession of frames from one or more sources and of segregating, queuing, and transmitting the frames based on their class of service.

[0017] Station 200 comprises: host interface 201, receiver 202, processor 203, queues 204-1 to 204-L, wherein L is a positive integer greater than one, and transmitter 205, interconnected as shown.

[0018] Host interface 201 a circuit that is capable of receiving data and instructions from a host (not shown), in well-known fashion, and of forwarding them to processor 203. Furthermore, host interface 201 enables station 200 to send data and status indicators to the host. It will be clear to those skilled in the art how to make and use host interface 201.

[0019] Receiver 202 is a circuit that is capable of receiving frames from shared-communications channel, in well-known fashion, and of forwarding them to processor 203. The frames include both data frames and control frames, such as request-to-send, clear-to-send, and acknowledgement frames.

[0020] Processor 203 is a general-purpose processor that is capable of performing the tasks described below and with respect to FIGS. 3 and 4. It will be clear to those skilled in the art, after reading this specification, how to make and use processor 203.

[0021] Queues 204-i, for i=1 to L, are each first-in, first-out memories. Each of queues 204-1 through 204-L are uniquely associated with application i, which is associated with a class of service. In accordance with the illustrative embodiment, each class of service is associated with one or more quality-of-service parameters (e.g., minimum throughput, maximum latency, etc.).

[0022] Each of queues 204-1 through 204-L holds one or more frames pending transmission by station 200 on the shared communications channel. It will be clear to those skilled in the art how to make and uses queues 204-1 through 204-L.

[0023] Transmitter 205 is a circuit that is capable of receiving frames from processor 203, in well-known fashion, and of transmitting them on the shared communications channel.

[0024]FIG. 3 depicts a flowchart of the salient tasks performed by the illustrative embodiment of the present invention.

[0025] At task 301, host interface 201 receives data and instructions from a host that indicate that the data is to be transmitted onto the shared-communications channel and that the data is associated with application i.

[0026] At task 302, processor 203 receives the data from host interface 201, divides the data into frames, in well-known fashion, and queues the frames onto the end of queue 204-i.

[0027] At task 303, station 200 acquires, in well-known fashion, an opportunity to transmit one or more frames associated with application i. In accordance with the illustrative embodiment, this opportunity enables station 200 to transmit a burst of up to M frames over shared-communications channel, where M is a positive integer.

[0028] Because station 200 operates in accordance with IEEE 802.11, station 200 becomes aware of a transmission opportunity in accordance with the distributed coordination function, the extended distributed coordination function, or the point coordination function. It will be clear to those skilled in the art how to make and use embodiments of the present invention that use different medium access control protocols.

[0029] Processor 203 continually determines from which one of queues 204-1 through 204-L to next draw frames at the next transmission opportunity. In other words, conceptually queues 204-1 through 204-L in station 200 are vying with each other for transmission opportunities. For example, the queue whose frames are to be transmitted at the next transmission opportunity can be based on, for example,

[0030] i. a round robin scheme, or

[0031] ii. a random scheme, or

[0032] iii. the current number of frames queued in queue 204-i, or

[0033] iv. the latency tolerance of application i, or

[0034] v. the throughput requirements of application i, or

[0035] vi. the current number of frames queued in queue 204-i divided by N_(i).

[0036] It will be clear to those skilled in the art how to coordinate the selection of frames from queues 204-1 through 204-L.

[0037] At task 304, processor 203 determines the amount of time, T_(i), that is to be afforded to the transmission of frames for queue 204-i at this transmission opportunity. The value of T_(i) can be static or dynamic and can be the same for each station or different at each station. In accordance with the illustrative embodiment, each station determines its own values for T_(i) for each queue, and the value is updated periodically or sporadically. In accordance with the illustrative embodiment of the present invention, the value for T_(i) is based on:

[0038] i. the number of queues that have frames queued for transmission, or

[0039] ii. the number of frames queued in queue 204-i, or

[0040] iii. the latency tolerance of application i, or

[0041] iv. the throughput requirements of application i, or

[0042] v. the current number of frames queued in queue 204-i divided by N_(i), or

[0043] vi. any combination of i, ii, iii, iv, and v.

[0044] For example, applications that are more latency intolerant might be given larger values of T_(i) than applications that are less latency tolerant and applications that have greater throughput requirements might be given larger values of T_(i) than applications that have lesser throughput requirements. It will be clear to those skilled in the art, after reading this specification, how to determine and use other criteria for establishing T_(i) for application i.

[0045] To accomplish task 304, processor 203 advantageously maintains a table that correlates T_(i) and the number of frames queued in each queue to i. Table 1 depicts an illustrative version of this table. TABLE 1 Queued Frame Database Number of Frames Queued i in Queue 208-i T_(i) 1 13 23 ms. 2  7 25 ms. . . . . . . L 42  7 ms.

[0046] At task 305, processor 203 removes from queue 204-i the lesser of:

[0047] i. the number of frames queued in queue 204-i, and

[0048] ii. N_(i), wherein N_(i) is a positive integer,

[0049] and transmits them, as a contention-free burst, into the shared-communications channel, in well-known fashion. In accordance with the illustrative embodiment, the value of N_(i) is based on:

[0050] i. the time needed to transmit the next N_(i) data frames of queue 204-i in T_(i) seconds, or

[0051] ii. the time needed to receive N_(i) acknowledgement frames in T_(i) seconds, or

[0052] iii. the time needed for O(2N_(i)) short interval spaces, or iv. whether there will be a request-to-send frame, and if so, the time needed to transmit the request-to-send frame and receive the associated clear-to-send frame, or

[0053] v. the time needed to retransmit any of the N_(i) data frames due to transmission failures, or

[0054] vi. any combination of i, ii, iii, iv, and v.

[0055] In accordance with the illustrative embodiment, the value of N_(i) is less than the value of M because station 200 exercises self-restraint in the number of frames that it transmits at each transmission opportunity. This prevents the shared-communications channel from being monopolized or hogged by one application and lessens the amount of time that other applications have to wait before gaining access to the shared-communications channel.

[0056] When each station exercises such self-restraint, the applications that continually need access to the shared-communications channel—because of their relative latency intolerance—get the best opportunity to get the resources that they need.

[0057]FIG. 4 depicts a timeline of the frames transmitted in accordance with the illustrative embodiment of the present invention. Before time to, station 200 has obtained a transmission opportunity to transmit M frames into the shared-communications channel, and station 200 has decided to use that opportunity to send one or more frames associated with application i.

[0058] At time to, station 200 transmits an IEEE 802.11 Request-to-Send frame (RTS 401) that comprises a duration field to a remote station, in well-known fashion. In accordance with the illustrative embodiment, the duration field of the Request-to-Send frame comprises a value that is based on the lesser of N_(i) and the number of frames queued in queue 204-i. Typically, the value in the duration field is also based on an estimate of the length of time necessary for the transmission of the Clear-to-Send frame, the data frames, the acknowledgement frames, and the short interframe spaces between the frames. As is well-known to those skilled in the art, this invokes the virtual carrier sense mechanism in the stations that receive the message to refrain from transmitting while station 200 is transmitting the frames associated with application i.

[0059] At time t₁, the remote station transmits an IEEE 802.11 Clear-to-Send frame (CTS 402) in response to the Request-to-Send frame, in well-known fashion. The Clear-to-Send frame comprises a duration field comprises a value that is that is based on the lesser of N_(i) and the number of frames queued in queue 204-i. Typically, the value in the duration field is also based on an estimate of the length of time necessary for the transmission of the data frames, the acknowledgement frames, and the short interframe spaces between the frames.

[0060] At time t₄₀₃₋₁, station 200 transmits an IEEE 802.11 data frame (Data 403-1), which results in the transmission at time t₄₀₄₋₁ of an IEEE 802.11 acknowledgement frame (ACK 404-1). Data frames 403-2 through 403-N_(i) are subsequently transmitted by station 200 and are interleaved with acknowledgement frames 404-2 through 404-N_(i). After the receipt of acknowledgement frame 404-N_(i), another application is given the opportunity to transmit on the shared-communications channel.

[0061] It is understood that the above-described embodiments are merely illustrative of the present invention and that many variations of the above-described embodiments can be devised by those skilled in the art without departing from the scope of the invention. It is therefore intended that such variations be included within the scope of the following claims and their equivalents. 

What is claimed is:
 1. A method comprising: queuing m frames in a queue; and transmitting a maximum of n frames of said m frames into a shared-communications channel when presented with an opportunity to transmit all of said m frames into said shared-communications channel; wherein m and n are positive integers and m>n.
 2. The method of claim 1 wherein said m frames are associated with one class of service and wherein the value of n is based on said class of service.
 3. The method of claim 1 further comprising transmitting a Request-to-Send frame before transmitting said n frames, wherein said Request-to-Send frame comprises a duration field that is based on the value of n.
 4. The method of claim 1 further comprising receiving a Clear_to_Send frame before transmitting said n frames, wherein said Clear_to_Send frame comprises a duration field that is based on the value of n.
 5. An apparatus comprising: a queue for queuing m frames; and a transmitter for transmitting a maximum of n frames from said queue into a shared-communications channel when presented with an opportunity to transmit all of said m frames into said shared-communications channel; wherein m and n are positive integers and m>n.
 6. The apparatus of claim 5 wherein said m frames are associated with one class of service and wherein the value of n is based on said class of service.
 7. The apparatus of claim 5 wherein said transmitter transmits a Request-to-Send frame before transmitting said n frames, wherein said Request-to-Send frame comprises a duration field that is based on the value of n.
 8. The apparatus of claim 5 further comprising a receiver for receiving a Clear_to_Send frame before said transmitter transmits said n frames, wherein said Clear_to_Send frame comprises a duration field that is based on the value of n.
 9. A method comprising: queuing m frames in a first queue, wherein each of said m frames are associated with a first class of service; queuing p frames in a second queue, wherein each of said p frames are associated with a second class of service; transmitting a maximum of n of said m frames into a shared-communications channel when presented with an opportunity to transmit all m frames into said shared-communications channel, wherein the value of n is based on said first class of service; and transmitting a maximum of q of said p frames into said shared-communications channel when presented with an opportunity to transmit all p frames into said shared-communications channel, wherein the value of q is based on said second class of service; wherein m, n, p, and q are positive integers, m>n, p>q, n≠q; and wherein the values of n and q are based on the relative priority of said first class of service and said second class of service.
 10. The method of claim 9 further comprising transmitting a Request-to-Send frame before transmitting said n frames, wherein said Request-to-Send frame comprises a duration field that is based on the value of n.
 11. The method of claim 9 further comprising receiving a Clear_to_Send frame before transmitting said n frames, wherein said Clear_to_Send frame comprises a duration field that is based on the value of n.
 12. An apparatus comprising: a first queue for queuing m frames, wherein said m frames are associated with a first class of service; a second queue for queuing p frames, wherein said p frames are associated with a second class of service; a transmitter for: (1) transmitting a maximum of n frames of said m frames into a shared-communications channel when presented with an opportunity to transmit all m frames into said shared-communications channel, wherein the value of n is based on said first class of service; and (2) transmitting a maximum of q frames of said p frames into said shared-communications channel when presented with an opportunity to transmit all p frames into said shared-communications channel, wherein the value of q is based on said second class of service; and a processor for coordinating said transmitting of said n frames versus said transmitting of said q frames; wherein m, n, p, and q are positive integers, m>n, p>q, n≠q.
 13. The apparatus of claim 12 wherein said transmitter transmits a Request-to-Send frame before transmitting said n frames, wherein said Request-to-Send frame comprises a duration field that is based on the value of n.
 14. The apparatus of claim 12 further comprising a receiver for receiving a Clear_to_Send frame before said transmitter transmits said n frames, wherein said Clear_to_Send frame comprises a duration field that is based on the value of n.
 15. A method comprising: queuing m frames in a first queue, wherein said m frames are associated with a class of service; queuing p frames in a second queue; transmitting a maximum of n frames of said m frames into a shared-communications channel when presented with an opportunity to transmit all m frames into said shared-communications channel, wherein the value of n is based on said class of service; and transmitting one frame of said p frames into said shared-communications channel when presented with an opportunity to transmit all of said p frames; wherein m, n, p, and q are positive integers, m>n, p>q, n≠q; and wherein the values of n and q are based on the relative priority of said first class of service and said second class of service.
 16. The method of claim 15 further comprising transmitting a Request-to-Send frame before transmitting said n frames, wherein said Request-to-Send frame comprises a duration field that is based on the value of n.
 17. The method of claim 15 further comprising receiving a Clear_to_Send frame before transmitting said n frames, wherein said Clear_to_Send frame comprises a duration field that is based on the value of n.
 18. An apparatus comprising: a first queue for queuing m frames, wherein said m frames are associated with a class of service; a second queue for queuing p frames; a transmitter for: (1) transmitting a maximum of n frames of said m frames into a shared-communications channel when presented with an opportunity to transmit all m frames into said shared-communications channel, wherein the value of n is based on said class of service; and (2) transmitting one frame of said p frames into said shared-communications channel when presented with an opportunity to transmit; and a processor for coordinating said transmitting of said n frames versus said transmitting of said one frame; wherein m, n, and p are positive integers and m>n.
 19. The apparatus of claim 18 wherein said transmitter transmits a Request-to-Send frame before transmitting said n frames, wherein said Request-to-Send frame comprises a duration field that is based on the value of n.
 20. The apparatus of claim 18 further comprising a receiver for receiving a Clear_to_Send frame before said transmitter transmits said n frames, wherein said Clear_to_Send frame comprises a duration field that is based on the value of n. 